Using Case-Based Reasoning to Overcome High Computing Cost Interactive Simulations
نویسندگان
چکیده
This paper describes an innovative usage of Case-Based Re asoning to reduce the high computing cost derived from running large interactive simulation scenarios within the framework of advanced training systems. The paper discusses the ideas, implementation and a preliminary evaluation within the framework of the European IST research pro ject A-TEAM.
منابع مشابه
Improving Agent Performance for Multi-Resource Negotiation Using Learning Automata and Case-Based Reasoning
In electronic commerce markets, agents often should acquire multiple resources to fulfil a high-level task. In order to attain such resources they need to compete with each other. In multi-agent environments, in which competition is involved, negotiation would be an interaction between agents in order to reach an agreement on resource allocation and to be coordinated with each other. In recent ...
متن کاملInteractive Form-Generation in High-Performance Architecture Theory
Architecture as a designerly way of thinking and knowing is to interact with its environment. The manuscript is to speculate “interactive form-generation” based on high-performance architecture theory, and discuss the precursors and the potentials. The research aims to explore and determine the roots, aspects of interactive architecture as a part of performance-based design in contemporary arch...
متن کاملGreen Energy-aware task scheduling using the DVFS technique in Cloud Computing
Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...
متن کاملINTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کاملParallel computing using MPI and OpenMP on self-configured platform, UMZHPC.
Parallel computing is a topic of interest for a broad scientific community since it facilitates many time-consuming algorithms in different application domains.In this paper, we introduce a novel platform for parallel computing by using MPI and OpenMP programming languages based on set of networked PCs. UMZHPC is a free Linux-based parallel computing infrastructure that has been developed to cr...
متن کامل